On a Class of Constant Weight Codes

On a Class of Constant Weight Codes

For any odd prime power q we first construct a certain non-linear binary code C(q, 2) having (q − q)/2 codewords of length q and weight (q − 1)/2 each, for which the Hamming distance between any two distinct codewords is in the range [q/2 − 3√q/2, q/2 + 3√q/2] that is, ‘almost constant’. Moreover, we prove that C(q, 2) is distance-invariant. Several variations and improvements on this theme are...

On Equidistant Constant Weight Codes

Equidistant constant weight codes are studied in this paper. The dual distance distribution of equidistant constant weight codes is investigated and used to obtain upper bounds on the size of such codes as well as equidistant codes in general. ? 2003 Elsevier Science B.V. All rights reserved.

On the Constructions of Constant-Weight Codes

Optimal Constant Weight Codes

A new class of binary constant weight codes is presented. We establish new lower bound and exact values on A(n, 2k, k + 1), in particular, A(30, 12, 7) = 9, A(48, 16, 9) = 11, A(51,16, 9) = 12, A(58, 18, 10) = 12. An ( ) w d n , , constant weight binary code is a code of length n , code distance d in which all code words have the same number of “ones” . The number of “ones” is w . We will denot...

Constant-Weight Array Codes

Binary constant-weight codes have been extensively studied, due to both their numerous applications and to their theoretical significance. In particular, constant-weight codes have been proposed for error correction in store and forward. In this paper, we introduce constant-weight array codes (CWACs), which offer a tradeoff between the rate gain of general constant-weight codes and the low deco...